Cluster Dependent Classifiers for Online Signature Verification

In this paper, the applicability of notion of cluster dependent classifier for online signature verification is investigated. For every writer, by the use of a number of training samples, a representative is selected based on minimum average distance criteria (centroid) across all the samples of that writer. Later k-means clustering algorithm is employed to cluster the writers based on the chosen representatives. To select a suitable classifier for a writer, the equal error rate (EER) is estimated using each of the classifier for every writer in a cluster. The classifier which gives the lowest EER for a writer is selected to be the suitable classifier for that writer. Once the classifier for each writer in a cluster is decided, the classifier which has been selected for a maximum number of writers in that cluster is decided to be the classifier for all writers of that cluster. During verification, the authenticity of the query signature is decided using the same classifier which has been selected for the cluster to which the claimed writer belongs. In comparison with the existing works on online signature verification, which use a common classifier for all writers during verification, our work is based on the usage of a classifier which is cluster dependent. On the other hand our intuition is to recommend to use a same classifier for all and only those writers who have some common characteristics and to use different classifiers for writers of different characteristics. To demonstrate the efficacy of our model, extensive experiments are carried out on the MCYT online signature dataset (DB1) consisting signatures of 100 individuals. The outcome of the experiments being indicative of increased performance with the adaption of cluster dependent classifier seems to open up a new avenue for further investigation on a reasonably large dataset

Interval valued symbolic representation of writer dependent features for online signature verification

This work focusses on exploitation of the notion of writer dependent parameters for online signature verification. Writer dependent parameters namely features, decision threshold and feature dimension have been well exploited for effective verification. For each writer, a subset of the original set of features are selected using different filter based feature selection criteria. This is in contrast to writer independent approaches which work on a common set of features for all writers. Once features for each writer are selected, they are represented in the form of an interval valued symbolic feature vector. Number of features and the decision threshold to be used for each writer during verification are decided based on the equal error rate (EER) estimated with only the signatures considered for training the system. To demonstrate the effectiveness of the proposed approach, extensive experiments are conducted on both MCYT (DB1) and MCYT (DB2) benchmarking online signature datasets consisting of signatures of 100 and 330 individuals respectively using the available 100 global parametric features. © 2017 Elsevier Lt

Neighborhood Structure-Based Model for Multilingual Arbitrarily-Oriented Text Localization in Images/Videos

The text matter in an image or a video provides more important clue and semantic information of the particular event in the actual situation. Text localization task stands an interesting and challenging research-oriented process in the zone of image processing due to irregular alignments, brightness, degradation, and complexbackground. The multilingual textual information has different types of geometrical shapes and it makes further complex to locate the text information. In this work, an effective model is presented to locate the multilingual arbitrary oriented text. The proposed method developed a neighborhood structure model to locate the text region. Initially, the maxmin cluster is applied along with 3X3 sliding window to sharpen the text region. The neighborhood structure creates the boundary for every component using normal deviation calculated from the sharpened image. Finally, the double stroke structure model is employed to locate the accurate text region. The presented model is analyzed on five standard datasets such as NUS, arbitrarily oriented text, Hua's, MRRC and real-time video dataset with performance metrics such as recall, precision, and f-measure

Robust Model-Based Detection of Gable Roofs in Very-High-Resolution Aerial Images

This paper describes an improved version of our system for robust detection of buildings with a gable roof in varying rural areas from very-high-resolution aerial images. The algorithm follows a custom-made design, extracting key features close to modeling, such as roof ridges and gutters, in order to allow a large freedom in roof appearances. It starts by detecting straight line-segments as roof-ridge hypotheses, and for each of them, the likely roof-gutter positions are estimated. Supervised classification is employed to select the optimal gutter pair and to reject unlikely detections. Afterwards, overlapping detections are merged. Experiments on a large dataset containing 220 images, covering different rural regions with significant variation in both building appearance and surroundings, show that the system is able to detect over 87% of the present buildings, thereby handling common distortions, such as occlusions by trees

Detection of curved text in video: Quad tree based method

10.1109/ICDAR.2013.123Proceedings of the International Conference on Document Analysis and Recognition, ICDAR594-59

An eigen value based approach for text detection in video

10.1145/1815330.1815395ACM International Conference Proceeding Series501-50

Efficient Compressed Domain Target Image Search and Retrieval

In this paper we introduce a low complexity and accurate technique for target image search and retrieval. This method, which operates directly in the compressed JPEG domain, addresses two of the CBIR challenges stated by The Benchathlon Network regarding the search of a specific image: finding out if an exact same image exists in a database, and identifying this occurrence even when the database image has been compressed with a different coding bit-rate. The proposed technique can be applied in feature-containing or featureless image collections, and thus it is also suitable to search for image copies that might exist on the Web for law enforcement of copyrighted material. The reported method exploits the fact that the phase of the Discrete Cosine Transform coefficients contains a significant amount of information of a transformed image. By processing only the phase part of these coefficients, a simple, fast, and accurate target image search and retrieval technique is achieved